Multidimensional sampling theorems for multivariate discrete transforms

نویسندگان

چکیده

Abstract This paper is devoted to the establishment of two-dimensional sampling theorems for discrete transforms, whose kernels arise from second order partial difference equations. We define a type operator and investigate its spectral properties. Green’s function constructed that generate orthonormal basis eigenvectors are defined. A Kramer-type lemma introduced two Lagrange interpolation proved. Several illustrative examples depicted. The theory extendible higher settings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sampling Theorems for Multivariate Shift Invariant Subspaces ∗

Regular and irregular sampling theorems for multivariate shift invariant subspaces are studied. We give a characterization of regular points and an irregular sampling theorem, which covers many known results, e.g., Kadec’s 1/4-theorem. We show that some subspaces may not have a regular point. We also present a reconstruction algorithm which is slightly different from the known one but is more e...

متن کامل

Fourth-order Tensors with Multidimensional Discrete Transforms

The big data era is swamping areas including data analysis, machine/deep learning, signal processing, statistics, scientific computing, and cloud computing. The multidimensional feature and huge volume of big data put urgent requirements to the development of multilinear modeling tools and efficient algorithms. In this paper, we build a novel multilinear tensor space that supports useful algori...

متن کامل

Irregular sampling for multidimensional polar processing of integral transforms

We survey a family of theories that enable to process polar data via integral transforms. We show the relation between irregular sampling and discrete integral transforms, demonstrate the application of irregular (polar) sampling to image processing problems, and derive approximation algorithms that are based on unequally spaced samples. It is based on sampling the Fourier domain. We describe 2...

متن کامل

New fast algorithms of multidimensional Fourier and Radon discrete transforms

This paper describes a fast new n{D Discrete Radon Transform (DRT) and a fast exact inversion algorithm for it, without interpolating from polar to Cartesian coordinates or using the backprojection operator. New approach is based on the fast Nussbaumer's Polynomial Transform (NPT).

متن کامل

Fast algorithms of multidimensional discrete nonseparable -wave transforms

Fast algorithms for a wide class of non–separable n–dimensional (nD) discrete unitary K– transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix–2 FFT–type approach. The method utilizes a decomposition of the nDK–transform into the product of a new nD discrete Radon transform and of a set of parallel/independ 1D K–transforms. If the nD K–transform has a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Difference Equations

سال: 2021

ISSN: ['1687-1839', '1687-1847']

DOI: https://doi.org/10.1186/s13662-021-03368-y